Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(g(X)) → f(X)
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(g(X)) → f(X)
Q is empty.
We use [23] with the following order to prove termination.
Lexicographic Path Order [19].
Precedence:
trivial